A robust subband adaptive filter algorithm for sparse and block-sparse systems identification
نویسندگان
چکیده
This paper presents a new subband adaptive filter (SAF) algorithm for system identification scenario under impulsive interference, named generalized continuous mixed p-norm SAF (GCMPN-SAF) algorithm. The proposed uses GCMPN cost function to combat the interference. To further accelerate convergence rate in sparse and block-sparse processes, proportionate versions of algorithm, L0-norm GCMPN-SAF(L0-GCMPN-SAF) GCMPN-SAF (BS-GCMPN-SAF) algorithms are also developed. Moreover, analysis is provided. Simulation results show that have better performance than some other state-of-the-art literature with respect tracking capability.
منابع مشابه
Robust Estimation in Linear Regression with Molticollinearity and Sparse Models
One of the factors affecting the statistical analysis of the data is the presence of outliers. The methods which are not affected by the outliers are called robust methods. Robust regression methods are robust estimation methods of regression model parameters in the presence of outliers. Besides outliers, the linear dependency of regressor variables, which is called multicollinearity...
متن کاملA Subband Adaptive Filter
Recently a new real-valued oversampled filter bank has been proposed which reduces the “inband” alias. The filter bank consists of at least three channels which are subsampled by different subsampling ratios. In this paper we investigate into the applicability of this filter bank for adaptive subband filtering and compare the setup with existing subband and fullband techniques.
متن کاملAdaptive sparse system identification using normalized least mean fourth algorithm
Normalized least mean square (NLMS) was considered as one of the classical adaptive system identification algorithms. Because most of systems are often modeled as sparse, sparse NLMS algorithm was also applied to improve identification performance by taking the advantage of system sparsity. However, identification performances of NLMS type algorithms cannot achieve high-identification performan...
متن کاملAn Adaptive Greedy Algorithm with Application to Sparse Narma Identification
Greedy algorithms form an essential tool for compressed sensing. However, their inherent batch mode discourages their use in time-varying environments due to significant complexity and storage requirements. In this paper a powerful greedy scheme developed in [1, 2] is converted into an adaptive algorithm which is applied to estimation of nonlinear channels. Performance is assessed via computer ...
متن کاملSparsity-Aware and Noise-Robust Subband Adaptive Filter
This paper presents a subband adaptive filter (SAF) for a system identification where an impulse response is sparse and disturbed with an impulsive noise. Benefiting from the uses of l1-norm optimization and l0-norm penalty of the weight vector in the cost function, the proposed l0-norm sign SAF (l0-SSAF) achieves both robustness against impulsive noise and much improved convergence behavior th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2021
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2021.000041